Signed tilings by ribbon L n-ominoes, n even, via Gröbner bases

نویسندگان

  • Kenneth Gill
  • Viorel Nitica
چکیده

Let Tn be the set of ribbon L-shaped n-ominoes for some n ≥ 4 even, and let T + n be Tn with an extra 2 × 2 square. We investigate signed tilings of rectangles by Tn and T + n . We show that a rectangle has a signed tiling by Tn if and only if both sides of the rectangle are even and one of them is divisible by n, or if one of the sides is odd and the other side is divisible by n ( n 2 − 2 ) . We also show that a rectangle has a signed tiling by T + n , n ≥ 6 even, if and only if both sides of the rectangle are even, or if one of the sides is odd and the other side is divisible by n ( n 2 − 2 ) . Our proofs are based on the exhibition of explicit Gröbner bases for the ideals generated by polynomials associated to the tiling sets. In particular, we show that some of the regular tiling results in V. Nitica, Every tiling of the first quadrant by ribbon L n-ominoes follows the rectangular pattern. Open Journal of Discrete Mathematics, 5, (2015) 11–25, cannot be obtained from coloring invariants.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Every Tiling of the First Quadrant by Ribbon L n-Ominoes Follows the Rectangular Pattern

Let n 4 ≥ and let n  be the set of four ribbon L-shaped n-ominoes. We study tiling problems for regions in a square lattice by n  . Our main result shows a remarkable property of this set of tiles: any tiling of the first quadrant by n  , n even, reduces to a tiling by n 2× and n 2 × rectangles, each rectangle being covered by two ribbon L-shaped n-ominoes. An application of our result is th...

متن کامل

A Method to Generate Polyominoes and Polyiamonds for Tilings with Rotational Symmetry

We show a simple method to generate polyominoes and polyiamonds that produce isohedral tilings with p3, p4 or p6 rotational symmetry by using n line segments between lattice points on a regular hexagonal, square and triangular lattice, respectively. We exhibit all possible tiles generated by this algorithm up to n = 9 for p3, n = 8 for p4, and n = 13 for p6. In particular, we determine for n ≤ ...

متن کامل

Rigid Tilings of Quadrants by L-Shaped n-ominoes and Notched Rectangles

In this paper, we examine rigid tilings of the four quadrants in a Cartesian coordinate system by tiling sets consisting of L-shaped polyominoes and notched rectangles. The first tiling sets we consider consist of an L-shaped polyomino and a notched rectangle, appearing from the dissection of an n×n square, and of their symmetries about the first diagonal. In this case, a tiling of a quadrant i...

متن کامل

Ribbon Tilings From Spherical Ones

The problem of classifying all tile-k-transitive tilings of the innnite 2-dimensional ribbon (and pinched-ribbon) is shown to be solvable by classifying certain tile-k-transitive tilings of the sphere, for all k 2 N. Complete results are listed for k 3.

متن کامل

Ribbon Tilings and Multidimensional Height Functions

We fix n and say a square in the two-dimensional grid indexed by (x, y) has color c if x+ y ≡ c (mod n). A ribbon tile of order-n is a connected polyomino containing exactly one square of each color. We show that the set of order-n ribbon tilings of a simply connected region R is in one-to-one correspondence with a set of height functions from the vertices of R to Zn satisfying certain differen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016